Convergence Rate of Distributed ADMM Over Networks
نویسندگان
چکیده
منابع مشابه
Distributed Multiagent Optimization: Linear Convergence Rate of ADMM
We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions. This optimization problem captures many applications in distributed machine learning and statistical estimation. We provide a novel analysis that shows if the functions are strongly convex and have Lipschitz gradients, then an -optimal solution ca...
متن کاملOnline Distributed ADMM on Networks
This paper presents a convergence analysis on distributed Alternating Direction Method of Multipliers (ADMM) for online convex optimization problems under linear constraints. The goal is to distributively optimize a global objective function over a network of decision makers. The global objective function is composed of convex cost functions associated with each agent. The local cost functions,...
متن کاملOn the Convergence Rate of Multi-Block ADMM
The alternating direction method of multipliers (ADMM) is widely used in solving structured convex optimization problems. Despite of its success in practice, the convergence properties of the standard ADMM for minimizing the sum of N (N ≥ 3) convex functions with N block variables linked by linear constraints, have remained unclear for a very long time. In this paper, we present convergence and...
متن کاملOn the Sublinear Convergence Rate of Multi-Block ADMM
The alternating direction method of multipliers (ADMM) is widely used in solving structured convex optimization problems. Despite of its success in practice, the convergence of the standard ADMM for minimizing the sum of N (N ≥ 3) convex functions whose variables are linked by linear constraints, has remained unclear for a very long time. Recently, Chen et al. [4] provided a counterexample show...
متن کاملExtending the ergodic convergence rate of the proximal ADMM
Pointwise and ergodic iteration-complexity results for the proximal alternating direction method of multipliers (ADMM) for any stepsize in (0, (1 + √ 5)/2) have been recently established in the literature. In addition to giving alternative proofs of these results, this paper also extends the ergodic iteration-complexity result to include the case in which the stepsize is equal to (1+ √ 5)/2. As...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2017.2677879